Three overlapping squares: The general case characterized & applications

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Overlapping Squares: The General Case Characterized

The “Three Squares Lemma” [7] famously explored the consequences of supposing that three squares occur at the same position in a string; essentially it showed that this phenomenon could not occur unless the longest of the three squares was at least the sum of the lengths of the other two. More recently, several papers [8, 25, 17, 11] have greatly extended this result by supposing that only two ...

متن کامل

More results on overlapping squares

Three recent papers [5, 11, 8] have considered in complementary ways the combinatorial consequences of assuming that three squares overlap in a string. In this paper we provide a unifying framework for these results: we show that in 12 of 14 subcases that arise the postulated occurrence of three neighbouring squares forces a breakdown into highly periodic behaviour, thus essentially trivial and...

متن کامل

Three Consecutive Almost Squares

Given a positive integer n, we let sfp(n) denote the squarefree part of n. We determine all positive integers n for which max{sfp(n), sfp(n+ 1), sfp(n+ 2)} ≤ 150 by relating the problem to finding integral points on elliptic curves. We also prove that there are infinitely many n for which max{sfp(n), sfp(n + 1), sfp(n + 2)} < n.

متن کامل

Medical Imaging Applications: Three Case Studies

In this paper three case studies are briefly presented and discussed regarding medical imaging applications. We report in some detail the activity of our laboratory related to: microarray image analysis, segmentation of 3D computed tomography imagery, breast shape analysis. Some of these results are being validated by people working in the related fields of expertise, such as the surgeons of th...

متن کامل

An overlapping theorem with applications

We establish a general and optimal lower bound for the complete sum of the probabilities of k-intersections of n events. We then describe various applications to additive and multiplicative number theory, graph theory, coding theory, study of lattice points on circles, and divisors of polynomials

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2015

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2015.06.037